weighted path length造句
例句與造句
- But weighted path lengths have an interesting property.
- In fact, this strategy generates a tree whose weighted path length is at most
- The tree with the minimal weighted path length is, by definition, statically optimal.
- To see this, consider what Knuth calls the " weighted path length " of a tree.
- The weighted path length of a tree on n elements is the sum of the lengths of all 2n + 1 possible search paths, weighted by their respective probabilities.
- It's difficult to find weighted path length in a sentence. 用weighted path length造句挺難的
- This means that the difference in weighted path length between a tree and its two subtrees is exactly the sum of every single probability in the tree, leading to the following recurrence:
- Let E be the weighted path length of a binary tree, E L be the weighted path length of its left subtree, and E R be the weighted path length of its right subtree.
- Let E be the weighted path length of a binary tree, E L be the weighted path length of its left subtree, and E R be the weighted path length of its right subtree.
- Let E be the weighted path length of a binary tree, E L be the weighted path length of its left subtree, and E R be the weighted path length of its right subtree.
- Let E _ { ij } be the weighted path length of the statically optimal search tree for all values between a i and a j, let W _ { ij } be the total weight of that tree, and let R _ { ij } be the index of its root.